Weak 1/r-Nets for Moving Points
نویسندگان
چکیده
In this paper, we extend the weak r -net theorem to a kinetic setting where the underlying set of points is moving polynomially with bounded description complexity. We establish that one can find a kinetic analog N of a weak r -net of cardinality O(r d(d+1) 2 log r) whose points are moving with coordinates that are rational functions with bounded description complexity. Moreover, each member of N has one polynomial coordinate. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, G.2.1 Combinatorics, G.2.2 Graph Theory
منابع مشابه
-nets for moving points.∗
In this paper, we extend the weak r -net theorem to a kinetic setting where the underlying set of points is moving polynomially with bounded description complexity. We establish that one can find a kinetic analog N of a weak r -net of cardinality O(r d(d+1) 2 log r) whose points are moving with coordinates that are rational functions with bounded description complexity. Moreover, each member of...
متن کاملA short proof of the first selection lemma and weak $\frac{1}{r}$-nets for moving points
i) We provide a short and simple proof of the first selection lemma. (ii) We also prove a selection lemma of a new type in R. For example, when d = 2 assuming n is large enough we prove that for any set P of n points in general position there are Ω(n) pairs of segments spanned by P all of which intersect in some fixed triangle spanned by P . (iii) Finally, we extend the weak 1 r -net theorem to...
متن کاملWeak - nets have basis of size O ( 1 / log ( 1 / ) ) in any dimension
Given a set P of n points in Rd and > 0, we consider the problem of constructing weak -nets for P . We show the following: pick a random sample Q of size O(1/ log (1/ )) from P . Then, with constant probability, a weak -net of P can be constructed from only the points of Q. This shows that weak -nets in Rd can be computed from a subset of P of size O(1/ log(1/ )) with only the constant of propo...
متن کاملImre Bárány, Lecture 4
Let X ⊂ R d be a set of n points in general position (i.e. no d + 1 points of X lie on the same hyperplane.) For a positive 0 < ε < 1, we define A finite set S ⊂ R d is called a (weak) ε-net of X if S ∩ F = ∅ for any F ∈ F ε. We note that S is called a strong ε-net if, in addition, it also satisfies S ⊂ X. Since we are only going to discuss weak ε-nets, we will simply call these ε-nets. Our goa...
متن کاملHow to Net a Convex Shape
We revisit the problem of building weak ε-nets for convex ranges over a point set in R. Unfortunately, the known constructions of weak ε-nets yields sets that are of size Ω(ε−decd 2 ), where c is some constant. We offer two alternative schemes that yield significantly smaller sets, and two related results, as follows: (A) Let S be a sample of size Õ(dε) points from the original point set (which...
متن کامل